Configuration of automated update routines

ABSTRACT

A method for executing a software update within a dispersed storage network (DSN) includes determining, by a management unit of the DSN, a type of the software update. The method further includes generating, based on the type of the software update, a software update plan for updating a set of storage unit groups of the DSN, where a first storage unit group of the set of storage unit groups includes one or more storage units and stores first encoded data slices of pluralities of sets of encoded data slices, and where the software update plan aggressively takes storage units of the set of storage unit groups offline for executing the software update when the type of the software update requires urgency while maintaining a sufficient number of storage units online to fulfill DSN access requests. The method further includes executing, by the management unit, the software update plan to update the set of groups of storage units with the software update.

CROSS REFERENCE TO RELATED PATENTS

The present U.S. Utility patent application claims priority pursuant to35 U.S.C. §119(e) to U.S. Provisional Application No. 62/314,792,entitled “SELECTING A PROCESSING UNIT IN A DISPERSED STORAGE NETWORK,”filed Mar. 29, 2016, which is incorporated herein by reference in itsentirety and made part of the present U.S. Utility patent applicationfor all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and moreparticularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/orstore data. Such computing devices range from wireless smart phones,laptops, tablets, personal computers (PC), work stations, and video gamedevices, to data centers that support millions of web searches, stocktrades, or on-line purchases every day. In general, a computing deviceincludes a central processing unit (CPU), a memory system, userinput/output interfaces, peripheral device interfaces, and aninterconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using“cloud computing” to perform one or more computing functions (e.g., aservice, an application, an algorithm, an arithmetic logic function,etc.) on behalf of the computer. Further, for large services,applications, and/or functions, cloud computing may be performed bymultiple cloud computing resources in a distributed manner to improvethe response time for completion of the service, application, and/orfunction. For example, Hadoop is an open source software framework thatsupports distributed applications enabling application execution bythousands of computers.

In addition to cloud computing, a computer may use “cloud storage” aspart of its memory system. As is known, cloud storage enables a user,via its computer, to store files, applications, etc. on an Internetstorage system. The Internet storage system may include a RAID(redundant array of independent disks) system and/or a dispersed storagesystem that uses an error correction scheme to encode data for storage.When unplanned, software update execution within a dispersed storagesystem may cause system optimization issues.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an errorencoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an errorencoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of anencoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an errordecoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of an embodiment of executing asoftware update within a dispersed storage network (DSN) in accordancewith the present invention; and

FIG. 10 is a logic diagram of an example of a method for executing asoftware update within a dispersed storage network (DSN) in accordancewith the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, ordistributed, storage network (DSN) 10 that includes a plurality ofcomputing devices 12-16, a managing unit 18, an integrity processingunit 20, and a DSN memory 22. The components of the DSN 10 are coupledto a network 24, which may include one or more wireless and/or wirelined communication systems; one or more non-public intranet systemsand/or public internet systems; and/or one or more local area networks(LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may belocated at geographically different sites (e.g., one in Chicago, one inMilwaukee, etc.), at a common site, or a combination thereof. Forexample, if the DSN memory 22 includes eight storage units 36, eachstorage unit is located at a different site. As another example, if theDSN memory 22 includes eight storage units 36, all eight storage unitsare located at the same site. As yet another example, if the DSN memory22 includes eight storage units 36, a first pair of storage units are ata first common site, a second pair of storage units are at a secondcommon site, a third pair of storage units are at a third common site,and a fourth pair of storage units are at a fourth common site. Notethat a DSN memory 22 may include more or less than eight storage units36. Further note that each storage unit 36 includes a computing core (asshown in FIG. 2, or components thereof) and a plurality of memorydevices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and theintegrity processing unit 20 include a computing core 26, which includesnetwork interfaces 30-33. Computing devices 12-16 may each be a portablecomputing device and/or a fixed computing device. A portable computingdevice may be a social networking device, a gaming device, a cell phone,a smart phone, a digital assistant, a digital music player, a digitalvideo player, a laptop computer, a handheld computer, a tablet, a videogame controller, and/or any other portable device that includes acomputing core. A fixed computing device may be a computer (PC), acomputer server, a cable set-top box, a satellite receiver, a televisionset, a printer, a fax machine, home entertainment equipment, a videogame console, and/or any type of home or office computing equipment.Note that each of the managing unit 18 and the integrity processing unit20 may be separate computing devices, may be a common computing device,and/or may be integrated into one or more of the computing devices 12-16and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to supportone or more communication links via the network 24 indirectly and/ordirectly. For example, interface 30 supports a communication link (e.g.,wired, wireless, direct, via a LAN, via the network 24, etc.) betweencomputing devices 14 and 16. As another example, interface 32 supportscommunication links (e.g., a wired connection, a wireless connection, aLAN connection, and/or any other type of connection to/from the network24) between computing devices 12 and 16 and the DSN memory 22. As yetanother example, interface 33 supports a communication link for each ofthe managing unit 18 and the integrity processing unit 20 to the network24.

Computing devices 12 and 16 include a dispersed storage (DS) clientmodule 34, which enables the computing device to dispersed storage errorencode and decode data (e.g., data 40) as subsequently described withreference to one or more of FIGS. 3-8. In this example embodiment,computing device 16 functions as a dispersed storage processing agentfor computing device 14. In this role, computing device 16 dispersedstorage error encodes and decodes data on behalf of computing device 14.With the use of dispersed storage error encoding and decoding, the DSN10 is tolerant of a significant number of storage unit failures (thenumber of failures is based on parameters of the dispersed storage errorencoding function) without loss of data and without the need for aredundant or backup copies of the data. Further, the DSN 10 stores datafor an indefinite period of time without data loss and in a securemanner (e.g., the system is very resistant to unauthorized attempts ataccessing the data).

In operation, the managing unit 18 performs DS management services. Forexample, the managing unit 18 establishes distributed data storageparameters (e.g., vault creation, distributed storage parameters,security parameters, billing information, user profile information,etc.) for computing devices 12-14 individually or as part of a group ofuser devices. As a specific example, the managing unit 18 coordinatescreation of a vault (e.g., a virtual memory block associated with aportion of an overall namespace of the DSN) within the DSN memory 22 fora user device, a group of devices, or for public access and establishesper vault dispersed storage (DS) error encoding parameters for a vault.The managing unit 18 facilitates storage of DS error encoding parametersfor each vault by updating registry information of the DSN 10, where theregistry information may be stored in the DSN memory 22, a computingdevice 12-16, the managing unit 18, and/or the integrity processing unit20.

The managing unit 18 creates and stores user profile information (e.g.,an access control list (ACL)) in local memory and/or within memory ofthe DSN memory 22. The user profile information includes authenticationinformation, permissions, and/or the security parameters. The securityparameters may include encryption/decryption scheme, one or moreencryption keys, key generation scheme, and/or data encoding/decodingscheme.

The managing unit 18 creates billing information for a particular user,a user group, a vault access, public vault access, etc. For instance,the managing unit 18 tracks the number of times a user accesses anon-public vault and/or public vaults, which can be used to generate aper-access billing information. In another instance, the managing unit18 tracks the amount of data stored and/or retrieved by a user deviceand/or a user group, which can be used to generate a per-data-amountbilling information.

As another example, the managing unit 18 performs network operations,network administration, and/or network maintenance. Network operationsincludes authenticating user data allocation requests (e.g., read and/orwrite requests), managing creation of vaults, establishingauthentication credentials for user devices, adding/deleting components(e.g., user devices, storage units, and/or computing devices with a DSclient module 34) to/from the DSN 10, and/or establishing authenticationcredentials for the storage units 36. Network administration includesmonitoring devices and/or units for failures, maintaining vaultinformation, determining device and/or unit activation status,determining device and/or unit loading, and/or determining any othersystem level operation that affects the performance level of the DSN 10.Network maintenance includes facilitating replacing, upgrading,repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missingencoded data slices. At a high level, the integrity processing unit 20performs rebuilding by periodically attempting to retrieve/list encodeddata slices, and/or slice names of the encoded data slices, from the DSNmemory 22. For retrieved encoded slices, they are checked for errors dueto data corruption, outdated version, etc. If a slice includes an error,it is flagged as a ‘bad’ slice. For encoded data slices that were notreceived and/or not listed, they are flagged as missing slices. Badand/or missing slices are subsequently rebuilt using other retrievedencoded data slices that are deemed to be good slices to produce rebuiltslices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (TO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface module 60, at least one IO device interface module 62, aread only memory (ROM) basic input output system (BIOS) 64, and one ormore memory interface modules. The one or more memory interfacemodule(s) includes one or more of a universal serial bus (USB) interfacemodule 66, a host bus adapter (HBA) interface module 68, a networkinterface module 70, a flash interface module 72, a hard drive interfacemodule 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operatingsystem (OS) file system interface (e.g., network file system (NFS),flash file system (FFS), disk file system (DFS), file transfer protocol(FTP), web-based distributed authoring and versioning (WebDAV), etc.)and/or a block memory interface (e.g., small computer system interface(SCSI), internet small computer system interface (iSCSI), etc.). The DSNinterface module 76 and/or the network interface module 70 may functionas one or more of the interface 30-33 of FIG. 1. Note that the IO deviceinterface module 62 and/or the memory interface modules 66-76 may becollectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data. When a computing device 12 or 16 has data tostore it disperse storage error encodes the data in accordance with adispersed storage error encoding process based on dispersed storageerror encoding parameters. The dispersed storage error encodingparameters include an encoding function (e.g., information dispersalalgorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding,non-systematic encoding, on-line codes, etc.), a data segmentingprotocol (e.g., data segment size, fixed, variable, etc.), and per datasegment encoding values. The per data segment encoding values include atotal, or pillar width, number (T) of encoded data slices per encodingof a data segment (i.e., in a set of encoded data slices); a decodethreshold number (D) of encoded data slices of a set of encoded dataslices that are needed to recover the data segment; a read thresholdnumber (R) of encoded data slices to indicate a number of encoded dataslices per set to be read from storage for decoding of the data segment;and/or a write threshold number (W) to indicate a number of encoded dataslices per set that must be accurately stored before the encoded datasegment is deemed to have been properly stored. The dispersed storageerror encoding parameters may further include slicing information (e.g.,the number of encoded data slices that will be created for each datasegment) and/or slice security information (e.g., per encoded data sliceencryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as theencoding function (a generic example is shown in FIG. 4 and a specificexample is shown in FIG. 5); the data segmenting protocol is to dividethe data object into fixed sized data segments; and the per data segmentencoding values include: a pillar width of 5, a decode threshold of 3, aread threshold of 4, and a write threshold of 4. In accordance with thedata segmenting protocol, the computing device 12 or 16 divides the data(e.g., a file (e.g., text, video, audio, etc.), a data object, or otherdata arrangement) into a plurality of fixed sized data segments (e.g., 1through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more).The number of data segments created is dependent of the size of the dataand the data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a datasegment using the selected encoding function (e.g., Cauchy Reed-Solomon)to produce a set of encoded data slices. FIG. 4 illustrates a genericCauchy Reed-Solomon encoding function, which includes an encoding matrix(EM), a data matrix (DM), and a coded matrix (CM). The size of theencoding matrix (EM) is dependent on the pillar width number (T) and thedecode threshold number (D) of selected per data segment encodingvalues. To produce the data matrix (DM), the data segment is dividedinto a plurality of data blocks and the data blocks are arranged into Dnumber of rows with Z data blocks per row. Note that Z is a function ofthe number of data blocks created from the data segment and the decodethreshold number (D). The coded matrix is produced by matrix multiplyingthe data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encodingwith a pillar number (T) of five and decode threshold number of three.In this example, a first data segment is divided into twelve data blocks(D1-D12). The coded matrix includes five rows of coded data blocks,where the first row of X11-X14 corresponds to a first encoded data slice(EDS 1_1), the second row of X21-X24 corresponds to a second encodeddata slice (EDS 2_1), the third row of X31-X34 corresponds to a thirdencoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to afourth encoded data slice (EDS 4_1), and the fifth row of X51-X54corresponds to a fifth encoded data slice (EDS 5_1). Note that thesecond number of the EDS designation corresponds to the data segmentnumber.

Returning to the discussion of FIG. 3, the computing device also createsa slice name (SN) for each encoded data slice (EDS) in the set ofencoded data slices. A typical format for a slice name 80 is shown inFIG. 6. As shown, the slice name (SN) 80 includes a pillar number of theencoded data slice (e.g., one of 1-T), a data segment number (e.g., oneof 1-Y), a vault identifier (ID), a data object identifier (ID), and mayfurther include revision level information of the encoded data slices.The slice name functions as, at least part of, a DSN address for theencoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces aplurality of sets of encoded data slices, which are provided with theirrespective slice names to the storage units for storage. As shown, thefirst set of encoded data slices includes EDS 1_1 through EDS 5_1 andthe first set of slice names includes SN 1_1 through SN 5_1 and the lastset of encoded data slices includes EDS 1_Y through EDS 5_Y and the lastset of slice names includes SN 1_Y through SN 5 Y.

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of a data object that was dispersed storage error encodedand stored in the example of FIG. 4. In this example, the computingdevice 12 or 16 retrieves from the storage units at least the decodethreshold number of encoded data slices per data segment. As a specificexample, the computing device retrieves a read threshold number ofencoded data slices.

To recover a data segment from a decode threshold number of encoded dataslices, the computing device uses a decoding function as shown in FIG.8. As shown, the decoding function is essentially an inverse of theencoding function of FIG. 4. The coded matrix includes a decodethreshold number of rows (e.g., three in this example) and the decodingmatrix in an inversion of the encoding matrix that includes thecorresponding rows of the coded matrix. For example, if the coded matrixincludes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2,and 4, and then inverted to produce the decoding matrix.

FIG. 9 is a schematic block diagram of an embodiment of executing asoftware update within a dispersed storage network (DSN). The DSN ofFIG. 9 includes a management unit 82 and a plurality of storage units isarranged as a set of storage unit groups. Storage unit group 1 includesstorage units SU#0_0-SU#0_4, storage unit group 2 includes storage unitsSU#1_0-SU#1_4, storage unit group 3 includes storage unitsSU#2_0-SU#2_4, storage unit group 4 includes storage unitsSU#3_0-SU#3_4, storage unit group 5 includes storage unitsSU#4_0-SU#4_4, and storage unit group 6 includes storage unitsSU#5_0-SU#5_4. Storage units SU#0_0, SU#1_0, SU#2_0, SU#3_0, SU#4_0, andSU#5_0 are affiliated with vault 1_1 and vault 2_1. Storage unitsSU#0_1, SU#1_1, SU#2_1, SU#3_1, SU#4_1, and SU#5_1 are affiliated withvault 1_2 and vault 3_1. Storage units SU#0_2, SU#1_2, SU#2_2, SU#3_2,SU#4_2, and SU#5_2 are affiliated with vault 2_2 and vault 3_2. Storageunits SU#0_3, SU#1_3, SU#2_3, SU#3_3, SU#4_3, and SU#5_3 are affiliatedwith vault 3_3. When the management unit 82 receives software updates 86for implementation in the DSN, the management unit 82 develops asoftware update plan 84 to execute the software update(s) 86 in the mostefficient and effective manner possible.

In an example of operation, the management unit 82 first determines thetype of software update(s) 86 that is to be implemented. The type ofsoftware update includes at least one of a critical securityvulnerability fix, a major release, a minor release, a patch release, abeta release, an alpha/development release, and a digitally signedrelease. Based on the type of software update and general timingrestrictions (e.g., permitted days of the week and/or hours during theday for software updates) the management unit 82 generates a softwareupdate plan 84. The software update plan aggressively takes storageunits of the set of storage unit groups offline for executing thesoftware update when the type of the software update requires urgencywhile maintaining a sufficient number of storage units online to fulfillDSN access requests.

Some software update types require more urgency or aggressiveness intheir implementation. For instance, a critical security vulnerabilityfix software update may require a more aggressive software update planwhile a major software update release may require a more conservativeplan. The aggressiveness of the update involves the number of storageunits to update at a time, the closeness of the number of storage unitgroups taken offline to the write threshold number/availabilitythreshold number of vaults, the time period to wait between storage unitupdates, and the fraction of storage units to update for a trial period.

For example, the software update plan 84 can take n-k storage unitgroups of the set of storage unit groups offline for an urgent softwareupdate (e.g., the critical security vulnerability fix software update),where n is the total number of groups of the set of storage unit groupswhich corresponds to a total number of error encoded data slices in theset of encoded data slices of a data object, and where k is a decodethreshold number. A decode threshold number is the number of slices ofencoded data slices of a set of encoded data slices that are needed torecover the data segment. For example, FIG. 9 includes 6 storage groupsand a decode threshold number of 3 storage groups. Therefore, accordingto this software update plan, a total of 3 storage groups may be takenoffline to execute the software update.

When the software update is less urgent (e.g., a full software release),the software update plan 84 may determine to take 1 storage unit groupoffline at a time for the software update. As another example, thesoftware update plan 84 may take n-r storage unit groups offline for thesoftware update, where r is a read threshold number. A read thresholdnumber of encoded data slices is a number of encoded data slices per setto be read from storage for decoding of the data segment. For example,FIG. 9 includes 6 storage groups and a read threshold number of 4.Therefore, according to this software update plan, a total of 2 storagegroups may be taken offline to execute the software update. As anotherexample, the software update plan 84 may take n-w storage unit groupsoffline for the software update, where w is a write threshold number. Awrite threshold is a number of encoded data slices per set that must beaccurately stored before the encoded data segment is deemed to have beenproperly stored. For example, FIG. 9 includes 6 storage groups and awrite threshold number of 4. Therefore, according to this softwareupdate plan, a total of 2 storage groups may be taken offline to executethe software update.

New software updates will be prioritized according to urgency but alsobased on the priority of other pending software updates. The managementunit 82 can access a list of pending software updates for the set ofstorage unit groups, where the pending software updates are prioritizedbased on respective types. The management unit 82 adds the new softwareupdate to the list of pending software updates based on the type ofsoftware update, and generate a plurality of software plans for theupdated list of pending software updates. The management unit 82 isoperable to generate and execute an individual software plan for eachstorage unit of the set of storage unit groups (as well as a plan forthe set as a whole). The management unit 82 is also operable to send thecorresponding software update plan to each storage unit of the set ofstorage unit groups for execution. The management unit 82 can executemore than one software update plan at a time, and can coordinate storageunits that are offline from each plan.

For example, the management unit 82 may determine a software update plan84 to take n-k storage groups offline (as discussed above) to perform anurgent software update (e.g., the critical security vulnerability fixsoftware update). However, another software update plan may still bepending. For example, the pending software update plan was for a fullsoftware release where 1 storage unit was taken offline at a time. Themanagement unit 82 is operable to coordinate the new plan while takinginto account the pending plan. For instance, if storage unit group 1 isoffline according to the pending software update plan, the new plan mayinstruct storage unit group 1 to install the urgent software updatewhile offline and instruct another two storage unit groups (e.g.,storage unit groups 2 and 3) to also go offline for the urgent softwareupdate.

Alternatively, or in addition to analyzing pending software updates, andthe timing and aggressiveness of the current software update, themanagement unit 82 obtains status information 88 from at least some ofthe storage units of the set of storage unit groups to generate thesoftware update plan 84. The status information 88 includes one or moreof: a list of current versions of installed software and an activitylevel indicator (e.g., storage unit usage). For example, the storageunits of the set of storage unit groups have provided the managementunit 82 with status information 88. Based on the status information 88the management unit 82 generates the software update plan 84 of the atleast some of the storage units that provided the status information. Asshown, the management unit 82 has generated a software update plan 84for all the storage units of the set of storage unit groups but has sentthe storage units of storage unit group 6 (SU#5_0-SU#5-4) individualsoftware update plans based on the provided status information 85 thatdiffers from the software update plan 84 sent to other storage unitgroups. For instance, the storage units of storage group 6 may have sentstatus information 88 indicating a high activity level. The softwareupdate plans based on the provided status information 85 may theninclude instructions to wait for the activity level to reduce prior toperforming the software update.

Generating the software update plan also includes determining userconfiguration information 90 for a group of users of the DSN. The userconfiguration information 90 includes one or more of: vault information,user identification information, data type storage information, and DSNsubscription information. The user configuration information 90 providesthe management unit 82 information regarding the quality of service andreliability expected as well as the bandwidth, throughput, and storagevolume of the group of users. The management unit 82 identifies the setof storage unit groups that support the group of users and generates thesoftware update plan for those identified storage units. For example,after analyzing the user configuration information 90, the managementunit 82 determines that users associated with vault 1_2 expect a higherlevel of service and reliability than users associated with othervaults. The management unit 82 identifies the storage units associatedwith vault 1_2 (SU#0_1-SU#5_1) and sends individual software updateplans based on the user configuration information 87 to SU#0_1-SU#5_1.

When the software update plan 84 is generated, the management unit 82executes the software update plan to update the set of groups of storageunits with the software update. The management unit 82 may also instructthe storage units to utilize a previous version of software until allstorage units of the set of storage unit groups are updated or until alast number of storage units of the set of storage unit groups are takenoffline for the software update.

FIG. 10 is a logic diagram of an example of a method for executing asoftware update within a dispersed storage network (DSN). The methodbegins with step 92 where the management unit of the DSN determines thetype of software update that is to be implemented. The type of softwareupdate includes at least one of a critical security vulnerability fix, amajor release, a minor release, a patch release, a beta release, analpha/development release, and a digitally signed release.

The method continues with step 94 where, based on the type of softwareupdate and general timing restrictions (e.g., permitted days of the weekand/or hours during the day for software updates) the management unitgenerates a software update plan for updating a set of storage unitgroups of the DSN. A first storage unit group of the set of storage unitgroups includes one or more storage units and stores first encoded dataslices of pluralities of sets of encoded data slices. A decode thresholdnumber of encoded data slices of a set of encoded data slices of thepluralities of sets of encoded data slices is needed to recover a datasegment of a data object of a plurality of data objects. The softwareupdate plan aggressively takes storage units of the set of storage unitgroups offline for executing the software update when the type of thesoftware update requires urgency while maintaining a sufficient numberof storage units online to fulfill DSN access requests. Some softwareupdate types require more urgency or aggressiveness in theirimplementation. For instance, a critical security vulnerability fixsoftware update may require a more aggressive software update plan. Theaggressiveness of the update involves the number of storage units toupdate at a time, the closeness of the number of storage unit groupstaken offline to the write threshold number/availability thresholdnumber of vaults, the time period to wait between storage unit update,and the fraction of storage units to update for a trial period.Therefore, for the critical security vulnerability fix software update,the software update plan may take as many storage unit groups aspossible offline at a time to perform the update.

For example, the software update plan may take n-k storage unit groupsof the set of storage unit groups offline for an urgent software update,where n is the total number of groups of the set of storage unit groupswhich corresponds to a total number of error encoded data slices in theset of encoded data slices of a data object, and where k is a decodethreshold number. A decode threshold number is the number of slices ofencoded data slices of a set of encoded data slices that are needed torecover the data segment. When the urgency is lower, the software updateplan may take n-r storage unit groups offline for the software update,where r is a read threshold number. A read threshold number of encodeddata slices is a number of encoded data slices per set to be read fromstorage for decoding of the data segment. Further, the software updateplan may take n-w storage unit groups offline for the software update,where w is a write threshold number. A write threshold is a number ofencoded data slices per set that must be accurately stored before theencoded data segment is deemed to have been properly stored. Thesoftware update plan may also determine to take one storage unit groupoffline at a time for lower priority software updates (e.g., a fullsoftware release).

New software updates will be prioritized according to urgency but alsobased on the priority of other pending software updates. The managementunit accesses a list of pending software updates for the set of storageunit groups, where the pending software updates are prioritized based onrespective types. The management unit adds the new software update tothe list of pending software updates based on the type of softwareupdate, and generate a plurality of software plans for the updated listof pending software updates. The management unit is operable to generatean individual software plan for each storage unit of the set of storageunit groups (as well as for the set of storage unit groups as a whole).The management unit is also operable to send the corresponding softwareupdate plan to each storage unit of the set of storage unit groups forexecution. The management unit can execute more than one software updateplan at a time, and can coordinate storage units that are offline fromeach plan.

Alternatively, or in addition to analyzing pending software updates, andthe timing and aggressiveness of the current software update, themanagement unit may also obtain status information from at least some ofthe storage units of the set of storage unit groups to generate thesoftware update plan. The status information includes one or more of: alist of current versions of installed software and an activity levelindicator (e.g., storage unit usage). Based on the status information,the management unit generates the software update plan of the at leastsome of the storage units that provided the status information.

Generating the software update plan also includes determining userconfiguration information for a group of users of the DSN. The userconfiguration information includes one or more of: vault information,user identification information, data type storage information, and DSNsubscription information. The user configuration information providesthe management unit information as to the quality of service andreliability expected as well as the bandwidth, throughput, and storagevolume of the group of users. The management unit identifies the set ofstorage unit groups that support the group of users and generate thesoftware update plan for the identified storage units.

When the software update plan is generated, the method continues to step96 where the management unit executes the software update plan to updatethe set of groups of storage units with the software update. Themanagement unit may also instruct the storage units to utilize aprevious version of software until all storage units of the set ofstorage unit groups are updated or until a last number of storage unitsof the set of storage unit groups are taken offline for the softwareupdate.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, audio, etc. any of which may generally be referred to as‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “configured to”, “operably coupled to”, “coupled to”, and/or“coupling” includes direct coupling between items and/or indirectcoupling between items via an intervening item (e.g., an item includes,but is not limited to, a component, an element, a circuit, and/or amodule) where, for an example of indirect coupling, the intervening itemdoes not modify the information of a signal but may adjust its currentlevel, voltage level, and/or power level. As may further be used herein,inferred coupling (i.e., where one element is coupled to another elementby inference) includes direct and indirect coupling between two items inthe same manner as “coupled to”. As may even further be used herein, theterm “configured to”, “operable to”, “coupled to”, or “operably coupledto” indicates that an item includes one or more of power connections,input(s), output(s), etc., to perform, when activated, one or more itscorresponding functions and may further include inferred coupling to oneor more other items. As may still further be used herein, the term“associated with”, includes direct and/or indirect coupling of separateitems and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, and/or “processing unit” may be a singleprocessing device or a plurality of processing devices. Such aprocessing device may be a microprocessor, micro-controller, digitalsignal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, and/or processing unit may be, or furtherinclude, memory and/or an integrated memory element, which may be asingle memory device, a plurality of memory devices, and/or embeddedcircuitry of another processing module, module, processing circuit,and/or processing unit. Such a memory device may be a read-only memory,random access memory, volatile memory, non-volatile memory, staticmemory, dynamic memory, flash memory, cache memory, and/or any devicethat stores digital information. Note that if the processing module,module, processing circuit, and/or processing unit includes more thanone processing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with other routines. In this context, “start” indicates thebeginning of the first step presented and may be preceded by otheractivities not specifically shown. Further, the “continue” indicationreflects that the steps presented may be performed multiple times and/ormay be succeeded by other activities not specifically shown. Further,while a flow diagram indicates a particular ordering of steps, otherorderings are likewise possible provided that the principles ofcausality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form a solidstate memory, a hard drive memory, cloud memory, thumb drive, servermemory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for executing a software update within adispersed storage network (DSN), the method comprises: determining, by amanagement unit of the DSN, a type of the software update; based on thetype of the software update, generating, by the management unit, asoftware update plan for updating a set of storage unit groups of theDSN, wherein a first storage unit group of the set of storage unitgroups includes one or more storage units and stores first encoded dataslices of pluralities of sets of encoded data slices, wherein a decodethreshold number of encoded data slices of a set of encoded data slicesof the pluralities of sets of encoded data slices is needed to recover adata segment of a data object of a plurality of data objects, whereinthe software update plan aggressively takes storage units of the set ofstorage unit groups offline for executing the software update when thetype of the software update requires urgency while maintaining asufficient number of storage units online to fulfill DSN accessrequests; and executing, by the management unit, the software updateplan to update the set of storage unit groups with the software update.2. The method of claim 1, wherein the type of software update comprisesat least one of: a critical security vulnerability fix; a major release;a minor release; a patch release; a beta release; an alpha developmentrelease; and a digitally signed release.
 3. The method of claim 1further comprises: accessing, by the management unit, a list of pendingsoftware updates for the set of storage unit groups, wherein the pendingsoftware updates are prioritized based on respective types; adding, bythe management unit, the software update to the list of pending softwareupdates based on the type of software update; and generating, by themanagement unit, a plurality of software plans for the updated list ofpending software updates.
 4. The method of claim 1 further comprises:obtaining, by the management unit, status information from at least someof the storage units of the set of storage unit groups, wherein thestatus information includes one or more of: a list of current versionsof installed software, and an activity level indicator; and generating,by the management unit, the software update plan based on the statusinformation of the at least some of the storage units.
 5. The method ofclaim 1, wherein the generating the software update plan furthercomprises: generating, by the management unit, an individual softwareupdate plan for each storage unit of the set of storage unit groups; andsending, by the management unit, the corresponding individual softwareupdate plan to each storage unit of the set of storage unit groups. 6.The method of claim 1, wherein the generating the software update plancomprises one of: taking n-k storage unit groups of the set of storageunit groups offline for the software update, wherein n is the totalnumber of groups of the set of storage unit groups which corresponds toa total number of error encoded data slices in the set of encoded dataslices, and wherein k is a decode threshold number; taking n-r storageunit groups offline for the software update, wherein r is a readthreshold number; taking n-w storage unit groups offline for thesoftware update, wherein w is a write threshold number; and taking onestorage unit group offline at a time for the software update.
 7. Themethod of claim 1 further comprises: instructing, by the managementunit, to utilize a previous version of software until all storage unitsof the set of storage unit groups are updated or until a last number ofstorage units of the set of storage unit groups are taken offline forthe software update.
 8. The method of claim 1, wherein the generatingthe software update plan comprises: determining, for a group of users,user configuration information that includes one or more of: vaultinformation, user identification information, data type storageinformation, and DSN subscription information; identifying storage unitsof the set of storage unit groups that support the group of users; andgenerating the software update plan for the identified storage units inaccordance with the user configuration information.
 9. A management unitfor executing a software update within a dispersed storage network(DSN), the management unit comprises: an interface; memory; and aprocessing module operably coupled to the memory and the interface,wherein the processing module is operable to: determine a type of thesoftware update; based on the type of the software update, generate asoftware update plan for updating a set of storage unit groups of theDSN, wherein a first storage unit group of the set of storage unitgroups includes one or more storage units and stores first encoded dataslices of pluralities of sets of encoded data slices, wherein a decodethreshold number of encoded data slices of a set of encoded data slicesof the pluralities of sets of encoded data slices is needed to recover adata segment of a data object of a plurality of data objects, whereinthe software update plan aggressively takes storage units of the set ofstorage unit groups offline for executing the software update when thetype of the software update requires urgency while maintaining asufficient number of storage units online to fulfill DSN accessrequests; and execute the software update plan to update the set ofstorage unit groups with the software update.
 10. The management unit ofclaim 9, wherein the type of software update comprises at least one of:a critical security vulnerability fix; a major release; a minor release;a patch release; a beta release; an alpha development release; and adigitally signed release.
 11. The management unit of claim 9, whereinthe processing module is further operable to: access a list of pendingsoftware updates for the set of storage unit groups, wherein the pendingsoftware updates are prioritized based on respective types; add thesoftware update to the list of pending software updates based on thetype of software update; and generate a plurality of software plans forthe updated list of pending software updates.
 12. The management unit ofclaim 9, wherein the processing module is further operable to: obtainstatus information from at least some of the storage units of the set ofstorage unit groups, wherein the status information includes one or moreof: a list of current versions of installed software, and an activitylevel indicator; and generate the software update plan based on thestatus information of the at least some of the storage units.
 13. Themanagement unit of claim 9, wherein the processing module is furtheroperable to generate the software update plan by: generating anindividual software update plan for each storage unit of the set ofstorage unit groups; and sending the corresponding individual softwareupdate plan to each storage unit of the set of storage unit groups. 14.The management unit of claim 9, wherein the processing module is furtheroperable to generate the software update plan by: taking n-k storageunit groups of the set of storage unit groups offline for the softwareupdate, wherein n is the total number of groups of the set of storageunit groups which corresponds to a total number of error encoded dataslices in the set of encoded data slices, and wherein k is a decodethreshold number; taking n-r storage unit groups offline for thesoftware update, wherein r is a read threshold number; taking n-wstorage unit groups offline for the software update, wherein w is awrite threshold number; and taking one storage unit group offline at atime for the software update.
 15. The management unit of claim 9,wherein the processing module is further operable to: instruct toutilize a previous version of software until all storage units of theset of storage unit groups are updated or until a last number of storageunits of the set of storage unit groups are taken offline for thesoftware update.
 16. The management unit of claim 9, wherein theprocessing module is further operable to generate the software updateplan by: determining, for a group of users, user configurationinformation that includes one or more of: vault information, useridentification information, data type storage information, and DSNsubscription information; identifying storage units of the set ofstorage unit groups that support the group of users; and generating thesoftware update plan for the identified storage units in accordance withthe user configuration information.